|
In theoretical computer science, a circuit is a model of computation in which input values proceed through a sequence of gates, each of which computes a function. Circuits of this kind provide a generalization of Boolean circuits and a mathematical model for digital logic circuits. Circuits are defined by the gates they contain and the values the gates can produce. For example, the values in a Boolean circuit are boolean values, and the circuit includes conjunction, disjunction, and negation gates. The values in an integer circuit are sets of integers and the gates compute set union, set intersection, and set complement, as well as the arithmetic operations addition and multiplication. == Formal definition == A circuit is a triple , where * is a set of values, * is a set of gate labels, each of which is a function from to for some non-negative integer (where represents the number of inputs to the gate), and * is a labelled directed acyclic graph with labels from . The vertices of the graph are called ''gates''. For each gate of in-degree , the gate can be labeled by an element of if and only if is defined on . 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Circuit (computer science)」の詳細全文を読む スポンサード リンク
|